An Algebraic Formulation of the Graph Reconstruction Conjecture
نویسندگان
چکیده
منابع مشابه
An algebraic formulation of the graph reconstruction conjecture
The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be reconstructed up to isomorphism from its deck the collection of its vertex-deleted subgraphs. Kocay’s Lemma is an important tool in graph reconstruction. Roughly speaking, given the deck of a graph G and any finite sequence of graphs, it gives a linear constraint that every reconstruction of G m...
متن کاملINSTITUTO DE COMPUTAÇÃO UNIVERSIDADE ESTADUAL DE CAMPINAS An Algebraic Approach to the Graph Reconstruction Conjecture
In this paper we present a new approach to solve the Graph Reconstruction Conjecture. We reduce the problem of reconstructing connected graphs to the problem of finding a special system of linear equations with a unique solution. We also show how this method can be applied to some simple cases and propose some extensions that possibly could be used for a proof of the conjecture.
متن کاملA reduction of the Graph Reconstruction Conjecture
A graph is said to be reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all...
متن کاملThe graph formulation of the union-closed sets conjecture
In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph there are two adjacent vertices each belonging to at most half of the maximal stable sets. In this graph formulation other special cases become natural. The ...
متن کاملAn elementary proof of the reconstruction conjecture
The reconstruction conjecture states that the multiset of vertex-deleted subgraphs of a graph determines the graph, provided it has at least 3 vertices. This problem was independently introduced by Stanis law Ulam (1960) and Paul Kelly (1957). In this paper, we prove the conjecture by elementary methods. It is only necessary to integrate the Lenkle potential of the Broglington manifold over the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2015
ISSN: 0364-9024
DOI: 10.1002/jgt.21880